Verified solution of large systems and global optimization problems
نویسندگان
چکیده
منابع مشابه
Verified Solution of Large Systems and Global Optimization Problems
Recent results on the solution of large, banded or sparse systems and on global unconstrained optimization problems including verification of the correctness of the result will be discussed. The computing time for the verification for large linear systems is the same as for the decomposition, the total computational effort for verifying the global optimum value is for well-known test examples c...
متن کاملA Review of Techniques in the Verified Solution of Constrained Global Optimization Problems
Elements and techniques of state-of-the-art automatically verified constrained global optimization algorithms are reviewed, including a description of ways of rigorously verifying feasibility for equality constraints and a careful consideration of the role of active inequality constraints. Previously developed algorithms and general work on the subject are also listed. Limitations of present kn...
متن کاملPROJECTED DYNAMICAL SYSTEMS AND OPTIMIZATION PROBLEMS
We establish a relationship between general constrained pseudoconvex optimization problems and globally projected dynamical systems. A corresponding novel neural network model, which is globally convergent and stable in the sense of Lyapunov, is proposed. Both theoretical and numerical approaches are considered. Numerical simulations for three constrained nonlinear optimization problems a...
متن کاملA DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems
In this paper we propose a new algorithm for solving difficult largescale global optimization problems. We draw our inspiration from the well-known DIRECT algorithm which, by exploiting the objective function behavior, produces a set of points that tries to cover the most interesting regions of the feasible set. Unfortunately, it is well-known that this strategy suffers when the dimension of th...
متن کاملGlobal Solution of Mixed-Integer Dynamic Optimization Problems
This paper presents a decomposition approach for a quite general class of mixed-integer dynamic optimization problems that is capable of guaranteeing a global solution despite the nonconvexities inherent to the dynamic optimization subproblems. A case study is presented in connection to the optimal design and operation of a batch process consisting of a series reaction followed by a separation ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 1995
ISSN: 0377-0427
DOI: 10.1016/0377-0427(94)00092-f